Time and space complexity of combinatorial auction in Telecommunication

In this paper we evaluate time and space complexity of combinatorial auction solver. The application of combinatorial auction optimization problem in the area of telecommunication is presented. Using random problem instance generator we experimentally measured execution times and the amount of memory used for wide range of optimization problem sizes given as number of goods and number of bids. Results are reported as running times in seconds and memory used in kilobytes on a personal computer. We conclude that real world combinatorial auction problems can be solved on a personal computer.